首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   415篇
  免费   140篇
  国内免费   26篇
  2024年   1篇
  2023年   5篇
  2022年   6篇
  2021年   8篇
  2020年   7篇
  2019年   7篇
  2018年   3篇
  2017年   22篇
  2016年   27篇
  2015年   18篇
  2014年   36篇
  2013年   31篇
  2012年   26篇
  2011年   25篇
  2010年   22篇
  2009年   39篇
  2008年   24篇
  2007年   25篇
  2006年   26篇
  2005年   31篇
  2004年   26篇
  2003年   17篇
  2002年   14篇
  2001年   20篇
  2000年   21篇
  1999年   15篇
  1998年   10篇
  1997年   12篇
  1996年   11篇
  1995年   7篇
  1994年   6篇
  1993年   4篇
  1992年   11篇
  1991年   5篇
  1990年   8篇
  1989年   2篇
  1988年   2篇
  1987年   1篇
排序方式: 共有581条查询结果,搜索用时 125 毫秒
31.
正弦波型直流无刷电动机位置伺服系统的变结构控制   总被引:1,自引:0,他引:1  
在分析正弦波型直流无刷电动机数学模型的基础上,采用比例等速变速控制策略(PCV)设计控制器,应用于正弦波型直流无刷电动机位置伺服系统.仿真结果表明:与传统PI控制器比较,PCV控制策略可以明显改善系统的品质,并增强系统的鲁棒性.  相似文献   
32.
分布式结构的坦克火控仿真系统的研究   总被引:1,自引:0,他引:1  
采用现代仿真技术,分布式结构战车火控仿真系统在完成火控系统动态特性仿真任务后,可实现新火控系统研制过程的先期技术演示,并可为装备论证研究提供先进的仿真手段。此外还分析了以DIS结构接入到作战仿真系统的可能性和现实性。  相似文献   
33.
介绍一个动态互连全透明模拟训练系统设计过程,运用二级分布式结构实现实时模拟,并给出了某型导弹火力控制模拟系统硬件和多媒体软件结构模式  相似文献   
34.
粉末粒度对储氢电极电化学性能的影响   总被引:1,自引:0,他引:1  
以M1(NiCoMnTi)5为例,系统研究了粉末粒度对储氢电极电化学性能的影响。结果表明,在试验粒度范围内,合金粉越细,其放电容量越高,高倍率放电性能和循环稳定性也越好;将两种不同粒度的合金粉混合使用时,粒径相差越大,其放电容量越高。且当粗细粉质量比为7:3时,放电容量最高。  相似文献   
35.
基于复杂网络的作战网络分析   总被引:1,自引:0,他引:1  
分布式网络化作战是网络中心战的基础,而分布式作战网络的构建是网络化作战的重要前提。首先,运用复杂网络的相关参数分析了多种不同的网络,选择了BA非标度网络作为分布式作战网络的最优表现形式;其次,以BA非标度网络为基础提出了一个适合军事上动态鲁棒性分析的模型DCNCE;最后,仿真结果表明,在以网络效能值为测度的对比下,分布式作战网络在介数毁伤策略下更脆弱,为构建并改进现有的作战网络提供了理论依据。  相似文献   
36.
We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
37.
We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
38.
We introduce and develop models for a physical goods storage system based on the 15‐puzzle, a classic children's game in which 15 numbered tiles slide within a 4 × 4 grid. The objective of the game is to arrange the tiles in numerical sequence, starting from a random arrangement. For our purposes, the tiles represent totes, pallets, or even containers that must be stored very densely, and the objective is to maneuver items to an input–output point for retrieval or processing. We develop analytical results for storage configurations having a single empty location (as in the game) and experimental results for configurations with multiple empty locations. Designs with many empty locations can be made to form aisles, allowing us to compare puzzle‐based designs with traditional aisle‐based designs found in warehousing systems. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007  相似文献   
39.
遗传算法在防空导弹火力优化分配中的应用   总被引:2,自引:0,他引:2  
介绍了遗传算法的基本原理、算法设计并结合遗传算法主要解决了如何把目标分配给火力单元的问题,编写了相应的程序,并给出了一个基于遗传算法的火力优化分配方案。  相似文献   
40.
两点源诱偏系统是应用有源干扰的方式,利用反辐射导弹(ARM)本身的缺陷来对反辐射导弹的导引头进行干扰,从而达到保护主战雷达目的的一种有源干扰系统。主要从反辐射导弹的基本原理和有源诱偏的概念入手,对两点源诱偏系统进行理论推导、数学建模、布站设想,后引入毁伤概率指标对各种布站方式进行分类、仿真,对每一种仿真结果进行分析、评估,再把各种分析结果加以比较,从中找出最佳的布站方式。最后利用以上的分析结果,得出几点有用的结论。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号